Distributed debugging and tumult

A description is given of Tumult (Twente university multicomputer) and its operating system, along with considerations about parallel debugging, examples of parallel debuggers, and the proposed debugger for Tumult. Problems related to debugging distributed systems and solutions found in other distributed debuggers are discussed. The following are the main features of the debugger: it is event based, using a monitor for intercepting these events; record and reply are the main debugging techniques; preprocessing of events is done by programmable filters; the user interface is graphical, using grouping as the main abstraction mechanism. Parts of the debugger, as well as initial versions of the global and local event managers, have been implemented. A slow serial link between the front-end processor and the Tumult system has been replaced by a fast SCSI communication link. The user interface is partly textual, partly graphical. The languages used to implement the debugger are Modula-2 and C. The X Window System and OSF/Motif are used for the graphical user interfac

The stack resource protocol based on real time transactions

Current hard real time (HRT) kernels have their timely behaviour guaranteed at the cost of a rather restrictive use of the available resources. This makes current HRT scheduling techniques inadequate for use in a multimedia environment where one can profit by a better and more flexible use of the resources. It is shown that one can improve the flexibility and efficiency of real time kernels and a method is proposed for precise quality of service schedulability analysis of the stack resource protocol. This protocol is generalised by introducing real time transactions, which makes its use straightforward and efficient. Transactions can be refined to nested critical sections if the smallest estimation of blocking is desired. The method can be used for hard real time systems in general and for multimedia systems in particular

Early quantum task scheduling

An Early Quantum Task (EQT) is a Quantum EDF task that has shrunk its first period into one quantum time slot. Its purpose is to be executed as soon as possible, without causing deadline overflow of other tasks. We will derive the conditions under which an EQT can be admitted and can have an immediate start. The advantage of scheduling EQTs is shown by its use in a buffered multi-media server. The EQT is associated with a multimedia stream and it will use its first invocation to fill the buffer, such that a client can start receiving data immediately

Omphale: Streamlining the Communication for Jobs in a Multi Processor System on Chip

Our Multi Processor System on Chip (MPSoC) template provides processing tiles that are connected via a network on chip. A processing tile contains a processing unit and a Scratch Pad Memory (SPM). This paper presents the Omphale tool that performs the first step in mapping a job, represented by a task graph, to such an MPSoC, given the SPM sizes as constraints. Furthermore a memory tile is introduced. The result of Omphale is a Cyclo Static DataFlow (CSDF) model and a task graph where tasks communicate via sliding windows that are located in circular buffers. The CSDF model is used to determine the size of the buffers and the communication pattern of the data. A buffer must fit in the SPM of the processing unit that is reading from it, such that low latency access is realized with a minimized number of stall cycles. If a task and its buffer exceed the size of the SPM, the task is examined for additional parallelism or the circular buffer is partly located in a memory tile. This results in an extended task graph that satisfies the SPM size constraints

AmbientRT - real time system software support for data centric sensor networks

We present the architecture and design of a real time operating system for mobile wireless sensor networks. AmbientRT is being developed for environments with very limited resources in order to relieve the burden of the developer and to efficiently use the resources of the node. This paper presents the main concepts used and trade-offs involved in the system. Initial results show that with the current hardware available for sensor networks, the real time concept is feasible. For real-time scheduling we have designed EDFI. EDFI is a lightweight real-time scheduling protocol that combines EDF with deadline inheritance over shared resources. EDFI is precise with task admission control, very efficient with scheduling and dispatching, and straightforward in feasibility analysis

DCOS, a Real-Time Light-weight Data Centric Operating System

DCOS is a Data Centric lightweight Operating System for embedded devices. Despite limited energy and hardware resources, it supports a data driven architecture with provisions for dynamic loadable Modules. It combines these with Real-Time provisions based on Earliest Deadline First with a simple but smart resource handling mechanism. We will give an overview of the capabilities of DCOS and we will describe the basics of the main mechanisms

A Real time network at home

This paper proposes a home network which integrates both real-time and non-real-time capabilities for one coherent, distributed architecture. Such a network is not yet available. Our network will support inexpensive, small appliances as well as more expensive, large appliances. The network is based on a new type of real-time token protocol that uses scheduling to achieve optimal token-routing through the network. Depending on the scheduling algorithm, bandwidth utilisations of 100 percent are possible. Token management, to prevent token-loss or multiple tokens, is essential to support a dynamic, plug-and-play configuration. Small appliances, like sensors, would contain low-cost, embedded processors with limited computing power, which can handle lightweight network protocols. All other operations can be delegated to other appliances that have sufficient resources. This provides a basis for transparency, as it separates controlling and controlled object. Our network will support this. We will show the proposed architecture of such a network and present experiences with and preliminary research of our design

Impact of Network Density on Bandwidth Resource Management in WSN

We describe a self-organizing, clustering protocol for bandwidth resource management in Wireless Sensor Networks. The proposed protocol allows the sensor nodes to communicate by a time-slotted, scheduled MAC algorithm. When the nodes are densely deployed, i.e., the connectivity is very high, the MAC algorithm may not provide access for all of the nodes due to the limited number of time-slots, consequently the network capacity degrades. To overcome this drawback, we extend the time-slotted MAC algorithm by clustering the nodes into direrent frequency domains while they can use the same time domain. The idea is basically to multiplex the time domain with the frequency domain. As a result, the number of nodes that are granted access to the wireless medium is increased by the number of frequency channels available. By using simulations, we evaluate the performance of the protocol. The results reveal that frequency multiplexing has the erect of increasing the capacity up to 100%